The Trellis Complexity of Convolutional Codes - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

On the Twisted Squaring Construction, Symmetric-Reversible Designs and Trellis Diagrams of Block Cod - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

(32,26:1 (32.10) 28 21 19

Unit-Memory Hamming Turbo Codes - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes

Trellis group codes for the Gaussian channel

In this paper, trellis group codes are introduced as an extension of Slepian group codes to codes over sequence spaces. A trellis group code is defined over R” as the orbit of a bi-infinite “seed sequence”, 20 E (W”)‘, under an infinite, defining group of transformations. This group of transformations is generated by a symbolic system. The theory is developed by combining a nontrivial extension...

On bit-level trellis complexity of Reed-Muller codes

A formula, which relates the state dimensions of a minimal trellis of a Reed-Muller code to those of another Reed-Muller code with lower order and shorter length, is derived in this correspondence. State dimension at every position of a minimal trellis of any Reed-Muller code can be obtained by a recursive application of this formula.